An Orthogonal Multiprocessor for Parallel Scientific Computations
نویسندگان
چکیده
A new multiprocessor architecture, called orthogonal multiprocessor (OMP), is proposed in this paper. This OMP architecture has a simplified busing structure and partially shared memory, which compares very favorably over fully shared-memory multiprocessors using crossbar switch, multiple buses, or multistage networks. The higher performance comes mainly from significantly increased memory bandwidth, fully exploited parallelism, reduced communication overhead, and lower hardware control complexities. Parallel algorithms being mapped include matrix arithmetic, linear system solver, FFT, array sorting, linear programming, and parallel PDE solutions. In most cases, linear speedup can be achieved on the OMP system. The OMP architecture provides linearly scalable performance and is well suited for building special-purpose scientific computers such as for signal/image processing, machine sorting, linear system solvers, and PDE machines, etc.
منابع مشابه
Scheduling Simulations: An Experimental Approach to Time-Sharing Multiprocessor Scheduling Schemes
Real time systems that are logically programmed for scientific applications involve frequent job arrivals, thus requires a parallel architecture, so that maximum applications can be executed simultaneously resulting in less waiting time and maximum resource utilization. This must be achieved by workload partitioning & characterization, directs towards the development of Multiprocessor machines,...
متن کاملAn efficient mapping of Boltzmann Machine computations onto distributed-memory multiprocessors
Oh, D.H., J.H. Nang, H. Yoon and S.R. Maeng, An efficient mapping of Boltzmann Machine computations onto distributedmemory multiprocessors, Microprocessing and Microprogramming 33 (1991/92) 223-236. In this paper, an efficient mapping scheme of Boltzmann Machine computations onto a distributed-memory multiprocessor, which exploits the synchronous spatial parallelism, is presented. In this schem...
متن کاملAn Efficient RMS Admission Control and its Application to Multiprocessor Scheduling - Parallel Processing Symposium, 1998, and Symposium on Parallel and Distributed Processing 1998. 19
A real-time system must execute functionally correct computations in a timely mannel: In order to guarantee that all tasks accepted in the system will meet their timing requirements, an admission control algorithm must be used to only accept tasks whose requirements can be satisfied. Rate-monotonic scheduling (RMS) is arguably the best known scheduling policy for periodic real-time tasks on uni...
متن کاملWeber's law orthogonal to the psychometric function
Psychometric function plots the percentage of the correct responses among an entire pool of responses (cumulative probability) in a psychophysical task versus the amount of change in an independent variable. These changes in the independent variable are made with reference to a constant initial value. If this initial value is altered, the psychometric function will change according to Weber’s l...
متن کاملWeber's law orthogonal to the psychometric function
Psychometric function plots the percentage of the correct responses among an entire pool of responses (cumulative probability) in a psychophysical task versus the amount of change in an independent variable. These changes in the independent variable are made with reference to a constant initial value. If this initial value is altered, the psychometric function will change according to Weber’s l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Computers
دوره 38 شماره
صفحات -
تاریخ انتشار 1989